On chromatic equivalence of a pair of K4-homeomorphs
نویسندگان
چکیده
منابع مشابه
On Chromatic Equivalence Pair of a Family of K4-Homeomorphs
In this paper, we discuss a pair of chromatically equivalent of K4-homeomorphs of girth 11, that is, K4(1, 3, 7, d, e, f) and K4(1, 3, 7, d′, e′, f ′). As a result, we obtain two infinite chromatically equivalent non-isomorphic K4-homeomorphs. Mathematical Subject Classification: 05C15
متن کاملOn Chromatic Uniqueness of a Family of K4-Homeomorphs II
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H |H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. A K4-homeomorph denoted by K4(a, b, c, d, e, f) if the six edges of complete graph K4 are replaced by the six paths of length a, b, c, d, e, f respectively. In th...
متن کاملOn Chromatic Uniqueness of a Family of K4-Homeomorphs
In this paper, we study the chromatic uniqueness of one family of K4-homeomorphs with girth 10. 2000 Mathematics Subject Classification: 05C15
متن کاملChromatic uniqueness of a family of K4-homeomorphs
In this paper, we study the chromatic uniqueness of one family of K4-homeomorphs with girth 10. 2000 Mathematical Subject Classification. Primary 05C15.
متن کاملOn Chromatic Uniqueness And Equivalence of K4-Homeomorphic Graphs
A K4-homeomorph is a subdivision of the complete graph with four vertices (K4). Such a homeomorph is denoted by K4(a,b,c,d,e,f) if the six edges of K4 are replaced by the six paths of length a,b,c,d,e,f, respectively. In this paper, we discuss the chromaticity of a family of K4-homeomorphs with girth 10. We also give sufficient and necessary condition for some graphs in the family to be chromat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2010
ISSN: 1232-9274
DOI: 10.7494/opmath.2010.30.2.123